Guessing Secrets with Inner Product Questions
نویسندگان
چکیده
منابع مشابه
Guessing human-chosen secrets
This dissertation is the result of my own work and includes nothing which is the outcome of work done in collaboration except where specifically indicated in the text. No parts of this dissertation have been submitted for any other qualification. This dissertation does not exceed the regulation length of 60, 000 words, including tables and footnotes. To Fletcher, for teaching me the value of ha...
متن کاملA variant of the Guessing Secrets game
In [2], Chung et al. introduced the Guessing Secrets game. In [4] the authors introduce a variant of this game in which for each question the reference secret is chosen at random (with uniform distribution) by Responder. In this paper we investigate another variant in which Responder is required to answer truthfully to questions of the form How many secrets are there in X?, where X is a subset ...
متن کاملGuessing More Secrets via List Decoding
We consider the following game introduced by Chung, Graham, and Leighton in [Chung et al. 01]. One player, A, picks k > 1 secrets from a universe of N possible secrets, and another player, B, tries to gain as much information about this set as possible by asking binary questions f : [N ] −→ {0, 1}. Upon receiving a question f , A adversarially chooses one of her k secrets, and answers f accordi...
متن کاملProtecting Poorly Chosen Secrets from Guessing Attacks
In a security system that allows people to choose their own passwords those people tend to choose passwords that can be easily guessed This weakness exists in practically all widely used systems Instead of forcing users to choose well chosen secrets which are likely to be di cult to remember we propose solutions that maintain both user convenience and a high level of security at the same time T...
متن کاملProtecting Intellectual Property by Guessing Secrets
In the guessing secrets problem defined by Chung, Graham and Leighton [9], player B has to unveil a set of k > 1 secrets that player A has chosen from a pool of N secrets. To discover the secrets, player B is allowed to ask a series of boolean questions. For each question asked, A can adversarially choose one of the secrets but once he has made his choice he must answer truthfully. In this pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Internet Mathematics
سال: 2004
ISSN: 1542-7951,1944-9488
DOI: 10.1080/15427951.2004.10129082